Normal Forms for Modal Logics Kb and Ktb
نویسنده
چکیده
Normal forms for propositional modal logics are used to establish the Kripke completeness, the finite model property, and the decidability for modal logics KB and KTB.
منابع مشابه
Information Closure and the Sceptical Objection Faculty of Philosophy And
In this article, I define and then defend the principle of information closure (PIC) against a sceptical objection similar to the one discussed by Dretske in relation to the principle of epistemic closure. If I am successful, given that PIC is equivalent to the axiom of distribution and that the latter is one of the conditions that discriminate between normal and non-normal modal logics, a main...
متن کاملSome Admissible Rules in Modal Systems with the Brouwerian Axiom
The paper studies the admissibility of some cancellation rules in normal modal systems with the Brouwerian axiom. For example, KDB and KTB are proved to admit the following rule: if`:(^) and`3 3 then`:(_). Two notions of the preservation of validity by a rule on a frame are deened; on both, the preservation of validity by the preceding rule is shown not to be a rst{order condition. A speculativ...
متن کاملCluster expansion and the boxdot conjecture
The boxdot conjecture asserts that every normal modal logic that faithfully interprets T by the well-known boxdot translation is in fact included in T. We confirm that the conjecture is true. More generally, we present a simple semantic condition on modal logics L0 which ensures that the largest logic where L0 embeds faithfully by the boxdot translation is L0 itself. In particular, this natural...
متن کاملOn Formulas of One Variable in next (ktb)
In this paper we consider formulas written in one variable in the normal logic T2 = KTB ⊕ 2p → 2p. We present some special model for T2 to construct infinitely many non-equivalent formulas written in one variable and some family of models to construct continuum of logics over T2 ∗ .
متن کاملClausal Tableau Systems and Space Bounds for the Modal Logics
We propose so called clausal tableau systems for the common modal logics K , KD , T , KB , KDB and B . There is a measure such that for each tableau rule of these systems the measure of all its denominators is smaller than the measure of its numerator. Basing on these systems, we give a decision procedure for the logics, which uses O(n)-space for the logics T , KB , KDB and B , and O(n. logn)-s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008